#include"RBTree.h"

int main()
{
	int a[] = { 16, 3, 7, 11, 9, 26, 18, 14, 15 };
	RBTree<int, int> t;
	for (auto e : a)
	{
		t.insert(make_pair(e, e));
		cout << "insert:" << e << "->" << t.isbalance() << endl;
	}
	 
	return 0;
}